A Modified Schur Algorithm and an Extended Hamburger Moment Problem
نویسنده
چکیده
An algorithm for a Pick-Nevanlinna problem where the interpolation points coalesce into a finite set of points on the real line is introduced, its connection with certain multipoint Padé approximation problems is discussed, and the results are used to obtain the solutions of an extended Hamburger moment problem.
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملSolution of the Stieltjes Truncated Moment Problem
The conditions of solvability and description of all solutions of the truncated Stieltjes moment problem are obtained using as the starting point earlier results on the Hamburger truncated moment problem. An algebraic algorithm for the explicit solution of both problems is proposed.
متن کاملAn Extended Compact Genetic Algorithm for Milk Run Problem with Time Windows and Inventory Uncertainty
In this paper, we introduce a model to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...
متن کاملThe classical moment problem and generalized indefinite strings
We show that the classical Hamburger moment problem can be included in the spectral theory of generalized indefinite strings. Namely, we introduce the class of Krein–Langer strings and show that there is a bijective correspondence between moment sequences and this class of generalized indefinite strings. This result can be viewed as a complement to the classical results of M. G. Krein on the co...
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کامل